//:C07:PriorityQueue8.cpp
// A more compact version of PriorityQueue7.cpp.
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <iterator>
#include <queue>
using namespace std;

template<class T>
class PQV  : public priority_queue<T>
{
    public:
        typedef vector<T> TVec;
        TVec getVector()
        {
            TVec r(this->c.begin(), this->c.end());
            // c is already a heap
            sort_heap(r.begin(), r.end(), this->comp);
            // Put it into priority-queue order:
            reverse(r.begin(), r.end());
            return r;
        }
};

int main(void)
{
    PQV<int> pqi;
    srand(time(0));
    for (int i = 0; i < 100; i++)
    {
        pqi.push(rand() % 25);
    }

    const vector<int>& v = pqi.getVector();
    copy(v.begin(), v.end(),
        ostream_iterator<int>(cout, " "));
    cout << "\n--------" << endl;
    while (!pqi.empty())
    {
        cout << pqi.top() << ' ';
        pqi.pop();
    }    
}